package binarysearch;

public class Search {
    public static void main(String[] args) {
        int[] nums = {-1, 0, 3, 5, 9, 12};
        int target = -1;
        System.out.println(search(nums, target));
    }

    public static int search(int[] nums, int target) {
        int left = 0, n = nums.length, right = n - 1;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] < target) left = mid + 1;
            else if (nums[mid] > target) right = mid - 1;
            else {
                return mid;
            }
        }
        return -1;
    }
}
